2 research outputs found
On Sombor coindex of graphs
Motivated by the recently introduced topological index, the Somber index, we
define a new topological index of a graph in this paper, we call it Sombor
coindex. The Sombor coindex is defined by considering analogous contributions
from the pairs of non-adjacent vertices, capturing, thus, and quantifying a
possible influence of remote pairs of vertices. We give several properties of
the Somber coindex and its relations to the Sombor index, the Zagreb
(co)indices, forgotten coindex and other important graph parameters. We also
compute the bounds of the Somber coindex of some graph operations and compute
the Sombor coindex for some chemical graphs as an application
On general Sombor index
We present the bounds in terms of other important graph parameters for
general Sombor index which generalises both the forgotten index and the Sombor
index. We also explore the Nordhaus-Gaddum-type result for the general Sombor
index. We present further the relations between general Sombor index and other
generalised indices: general Randi\'c index and general sum-connectivity index